Dictionary-symbolwise flexible parsing

Dictionary-Symbolwise Flexible Parsing

Linear time optimal parsing algorithms are very rare in the dictionary based branch of the data compression theory. The most recent is the Flexible Parsing algorithm of Mathias and Shainalp that works when the dictionary is prefix closed and the encoding of dictionary pointers has a constant cost. We present the Dictionary-Symbolwise Flexible Parsing algorithm that is optimal for prefix-closed ...

Optimal Parsing in Dictionary-Symbolwise Data Compression Schemes

In this paper we introduce dictionary-symbolwise data compression schemes. We describe a method that, under some natural hypothesis, allows to obtain an optimal parse of any input or of any part of an input. This method can also be used to approximate the optimal parse in the general case and, under some additional hypothesis, it gives rise to on-line data compression algorithms. Therefore it c...

On Dictionary-Symbolwise Data Compression

Dictionaries, Dictionary Grammars and Dictionary Entry Parsing

We identify two complementary p.ro.cesses in. the conversion of machine-readable dmUonanes into lexical databases: recovery of the dictionary structure from the typographical markings which persist on the dictionary distribution tapes and embody the publishers' notational conventions; followed by making explicit all of the codified and ellided information packed into individual entries. We disc...

Flexible Parsing

When people use natural language in natural settings, they often use it ungrammatically, missing out or repeating words, breaking-off and restarting, speaking in fragments, etc.. Their human listeners are usually able to cope with these deviations with little difficulty. If a computer system wishes to accept natural language input from its users on a routine basis, it must display a similar ind...